Variational normal meshes
نویسندگان
چکیده
منابع مشابه
Compression of Normal Meshes
Normal meshes were recently introduced as a new way to represent geometry. A normal mesh is a multiresolution representation which has the property that all details lie in a known normal direction and hence the mesh depends only on a single scalar per vertex. Such meshes are ideally suited for progressive compression. We demonstrate such a compression algorithm for normal meshes representing co...
متن کاملGeneration of Tetrahedral Finite Element Meshes: Variational Delaunay Approach
The goal is to generate tetrahedral decomposition of a general solid body, whose surface is given as a collection of triangular facets. The principle idea is that a vertex set in general positions guarantees existence of a unique triangulation which satisses the Delaunay empty-sphere property. (Algorithms for robust, parallel construction of such triangulations are available.) However, all of t...
متن کاملEstimation-Quantization Geometry Coding Using Normal Meshes
We propose a new algorithm for compressing three-dimensional triangular mesh data used for representing surfaces. We apply the EstimationQuantization (EQ) algorithm originally designed for still image compression to the normal mesh wavelet coefficients. The EQ algorithm models the wavelet coefficients as a Gaussian random field with slowly varying standard deviation. By designing the quantizers...
متن کاملMultiscale Image Processing Using Normal Triangulated Meshes
Multiresolution triangulation meshes are widely used in computer graphics for 3-d modeling of shapes. We propose an image representation and processing framework using a multiscale triangulation of the grayscale function. Triangles have the potential of approximating edges better than the blocky structures of tensorproduct wavelets. Among the many possible triangulation schemes, normal meshes a...
متن کاملVariational method for untangling and optimization of spatial meshes
A variational method that can provably construct 3D quasi-isometric mappings between domains of a complex shape is introduced. A localmaximumprinciple for polyconvexmesh element distortion measures is formulated. It allows us to control the invertibility and distortion bounds for non-simplicial elements in the minimization process. A simple and efficient technique for construction of boundary o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2004
ISSN: 0730-0301,1557-7368
DOI: 10.1145/1027411.1027418